Throughput Maximization With an Average Age of Information Constraint in Fading Channels

In emerging fifth generation and beyond wireless communication systems, nodes are expected to support information flows that freshness-sensitive, along with broadband traffic having high data rate requirements. Freshness-sensitive flows, where freshness is quantified by a metric called the age of (AoI), naturally assigned priority over resources. Motivated this, we consider long-term average throughput maximization in single user fading channel, subject constraints on AoI power, knowledge channel state at transmitter (CSIT), which realization power gains. We two scenarios: (i) when Perfect CSIT available (ii) not available. both scenarios, distribution generate-at-will model, update packets can be generated any block interest, transmitter. propose simple age-independent stationary randomized policies (AI-SRP), allocate powers based only and/or information, without AoI. show optimal throughputs achieved AI-SRPs equal least half policies, independent all parameters problem. Furthermore, provide an expression bounds difference AI-SRPs. Finally, extensive numerical results illustrate performance